Abstract model theory - PDFSEARCH.IO - Document Search Engine

Abstract model theory
Results: 937

#	Item
211	Verifying Temporal Heap Properties Specified via Evolution Logic? Eran Yahav1 , Thomas Reps2 , Mooly Sagiv1 , and Reinhard Wilhelm3 1 School of Comp. Sci., Tel-Aviv Univ., Tel-Aviv, Israel, {yahave,msagiv}@post.tau.ac.i Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2004-11-16 12:33:58 Philosophical logic Model theory First-order logic FO Linear temporal logic Modal logic Abstract interpretation Mereology Tiny Encryption Algorithm Logic Mathematical logic Predicate logic
212	A Verification Toolkit for Numerical Transition Systems Tool Paper⋆ Hossein Hojjat1 , Filip Koneˇcn´y2,4, Florent Garnier2 , Radu Iosif2 , Viktor Kuncak1, and Philipp R¨ummer3 1 Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2012-06-11 13:15:35 Logic in computer science Model theory Presburger arithmetic Proof theory Data types Computability theory Oz Abstract interpretation Peano axioms Mathematical logic Mathematics Theoretical computer science
213	Model Theory, Algebra, and Geometry MSRI Publications Volume 39, 2000 Classical Model Theory of Fields LOU VAN DEN DRIES Add to Reading List Source URL: library.msri.org Language: English - Date: 2001-06-12 17:17:05 P-adically closed field Valuation Henselian ring P-adic number Ordered field Field Characteristic Ax–Kochen theorem Puiseux series Abstract algebra Algebra Field theory
214	Solving Parity Games in Practice Oliver Friedmann and Martin Lange Dept. of Computer Science, University of Munich, Germany Abstract. Parity games are 2-player games of perfect information and infinite duration that have Add to Reading List Source URL: files.oliverfriedmann.de Language: English - Date: 2012-02-10 07:43:17 Parity game Quantum field theory Quantum mechanics Determinacy Ω-automaton Automata theory Parity Solver Physics Game theory Finite model theory
215	ON A RESULT OF ARTIN AISE JOHAN DE JONG Let k be an algebraically closed field of characteristic p > 0. Let t be a parameter and set S = Spec(k[[t]]). Let f : X → S be a smooth proper morphism with generic fibre Xη an Add to Reading List Source URL: math.columbia.edu Language: English - Date: 2011-10-21 23:36:29 Algebra Homological algebra Algebraic geometry Crystalline cohomology Elementary class Structure Abstract algebra Model theory Mathematics
216	Journal of Algebraic Combinatorics), 111–136 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. ° Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2006-05-08 17:41:30 Combinatorics Algebraic combinatorics Kazhdan–Lusztig polynomial Polynomials Representation theory of Lie algebras Representation theory of Lie groups Permutation Model theory Mathematics Abstract algebra Algebra
217	Combining Theories with Shared Set Operations Thomas Wies, Ruzica Piskac, and Viktor Kuncak EPFL School of Computer and Communication Sciences, Switzerland Abstract. Motivated by applications in software verification, we Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2009-06-22 19:09:56 Model theory Formal languages Metalogic Semantics Predicate logic Interpretation First-order logic Well-formed formula Second-order logic Logic Mathematical logic Mathematics
218	Small Worlds as Navigable Augmented Networks — Model, Analysis, and Validation — Pierre Fraigniaud⋆ CNRS and University of Paris 7 Abstract. The small world phenomenon, a.k.a. the six degree of separation between Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2007-10-05 11:26:55 Networks Graph Tree decomposition Connectivity Complex network Geographic routing Minor Small-world network Graph coloring Graph theory Mathematics Network theory
219	Probabilistic Analysis of Onion Routing in a Black-box Model [Extended Abstract] † Joan Feigenbaum Add to Reading List Source URL: www.ohmygodel.com Language: English - Date: 2011-09-21 12:21:57 Probability Statistics Mathematical analysis Degree of anonymity Probability theory Crowds Conditional expectation
220	Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms? Annu Gmeiner, Igor Konnov, Ulrich Schmid, Helmut Veith, and Josef Widder Vienna University of Technology (TU Wien) Abstract. Recently we Add to Reading List Source URL: forsyte.at Language: English - Date: 2014-06-05 05:53:48 Fault-tolerant computer systems Fault tolerance Cryptography Theory of computation Consensus Model checking Distributed computing Byzantine fault tolerance Distributed algorithm Computing Theoretical computer science Concurrent computing

UPDATE